An Ishikawa-Hybrid Proximal Point Algorithm for Nonlinear Set-Valued Inclusions Problem Based on -Accretive Framework
نویسندگان
چکیده
منابع مشابه
An Ishikawa-Hybrid Proximal Point Algorithm for Nonlinear Set-Valued Inclusions Problem Based on (A,)-Accretive Framework
A general nonlinear framework for an Ishikawa-hybrid proximal point algorithm using the notion of A, η -accretive is developed. Convergence analysis for the algorithm of solving a nonlinear set-valued inclusions problem and existence analysis of solution for the nonlinear set-valued inclusions problem are explored along with some results on the resolvent operator corresponding to A, η -accretiv...
متن کاملA Hybrid Proximal Point Three-Step Algorithm for Nonlinear Set-Valued Quasi-Variational Inclusions System Involving (A,)-Accretive Mappings
The main purpose of this paper is to introduce and study a new class of generalized nonlinear setvalued quasi-variational inclusions system involving A, η -accretive mappings in Banach spaces. By using the resolvent operator due to Lan-Cho-Verma associated with A, η -accretive mappings and the matrix analysis method, we prove the convergence of a new hybrid proximal point three-step iterative a...
متن کاملThe Over-Relaxed A-Proximal Point Algorithm for General Nonlinear Mixed Set-Valued Inclusion Framework
The purpose of this paper is 1 a general nonlinear mixed set-valued inclusion framework for the over-relaxedA-proximal point algorithm based on the A, η -accretive mapping is introduced, and 2 it is applied to the approximation solvability of a general class of inclusions problems using the generalized resolvent operator technique due to Lan-Cho-Verma, and the convergence of iterative sequences...
متن کاملGeneral Framework for Proximal Point Algorithms on (a, Η)-maximal Monotonicity for Nonlinear Variational Inclusions
General framework for proximal point algorithms based on the notion of (A, η)-maximal monotonicity (also referred to as (A, η)monotonicity in literature) is developed. Linear convergence analysis for this class of algorithms to the context of solving a general class of nonlinear variational inclusion problems is successfully achieved along with some results on the generalized resolvent correspo...
متن کاملA generalized proximal point algorithm for the nonlinear complementarity problem
We consider a generalized proximal point method (GPPA) for solving the nonlinear complementarity problem with monotone operators in R ' \ lt differs from the classical proximal point method discussed by Rockafellar for the problem offinding zeroes of monotone operators in the use of generalized distances, called (p-divergences, instead of the Euclidean one. These distances play not only a regul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2010
ISSN: 1687-1812
DOI: 10.1155/2010/501293